منابع مشابه
The Williams Bjerknes Model on Regular Trees
We consider the Williams Bjerknes model, also known as the biased voter model on the d-regular tree T, where d ≥ 3. Starting from an initial configuration of “healthy” and “infected” vertices, infected vertices infect their neighbors at Poisson rate λ ≥ 1, while healthy vertices heal their neighbors at Poisson rate 1. All vertices act independently. It is well known that starting from a configu...
متن کاملThe rotor-router model on regular trees
The rotor-router model is a deterministic analogue of random walk. It can be used to define a deterministic growth model analogous to internal DLA. We show that the set of occupied sites for this model on an infinite regular tree is a perfect ball whenever it can be, provided the initial rotor configuration is acyclic (that is, no two neighboring vertices have rotors pointing to one another). T...
متن کاملInvasion percolation on regular trees
We consider invasion percolation on a rooted regular tree. For the infinite cluster invaded from the root, we identify the scaling behaviour of its r-point function for any r ≥ 2 and of its volume both at a given height and below a given height. In addition, we derive scaling estimates for simple random walk on the cluster starting from the root. We find that while the power laws of the scaling...
متن کاملReconstruction Thresholds on Regular Trees
We consider the model of broadcasting on a tree, with binary state space, on the infinite rooted tree k in which each node has k children. The root of the tree takes a random value 0 or 1, and then each node passes a value independently to each of its children according to a 2 2 transition matrix P. We say that reconstruction is possible if the values at the dth level of the tree contain non-va...
متن کاملOn the sandpile group of regular trees
The sandpile group of a connected graph is the group of recurrent configurations in the abelian sandpile model on this graph. We study the structure of this group for the case of regular trees. A description of this group is the following: Let T (d, h) be the d-regular tree of depth h and let V be the set of its vertices. Denote the adjacency matrix of T (d, h) by A and consider the modified La...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2009
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2008.05.012